Bi-criteria Scheduling on Parallel Machines Under Fuzzy Processing Time

نویسندگان

  • Sameer Sharma
  • Geeta Khanna
چکیده

Job scheduling is concerned with the optimal allocation of scare resources with objective of optimising one or several criteria. Job scheduling has been a fruitful area of research for many decades in which scheduling resolve both allocation of machines and order of processing. If the jobs are scheduled properly, not only the time is saved but also efficiency of system is increased. The parallel machine scheduling problem is widely studied optimization problem in which every machine has same work function and a job can be processed by any of available machines. Optimising dual performance measures on parallel machines in fuzzy environment is fairly an open area of research. In real life situations, the processing times of jobs are not always exact due to incomplete knowledge or an uncertain environment which implies the existence of various external sources and types of uncertainty. Fuzzy set theory can be used to handle uncertainty inherent in actual scheduling problems. This paper pertains to a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and total tardiness simultaneously. The fuzziness, vagueness or uncertainty in processing time of jobs is represented by triangular fuzzy membership function. The objective of the paper is to find the optimal sequence of jobs processing on parallel machines so as to minimize the secondary criterion of weighted flow time without violating the primary criterion of total tardiness. The bi-objective problem with total tardiness and weighted flow time as primary and secondary criteria respectively, for any number of parallel machines is NP-hard. A numerical illustration is carried out to the test efficiency of the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

متن کامل

Bi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria

Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...

متن کامل

Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness

Abstract: This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and maximum tardiness. The fuzziness, vagueness or uncertainty in processing time of jobs is represented by triangular fuzzy membership function. The bi-criteria problem with weighted flow time and maximum tardiness as primary and secondary criteria, respectiv...

متن کامل

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015